A wireless sensor network (WSN) is emerging as an innovative method for gathering\ninformation that will significantly improve the reliability and efficiency of infrastructure systems.\nBroadcast is a common method to disseminate information in WSNs. A variety of counter-based\nbroadcast schemes have been proposed to mitigate the broadcast-storm problems, using the count\nthreshold value and a random access delay. However, because of the limited propagation of\nthe broadcast-message, there exists a trade-off in a sense that redundant retransmissions of the\nbroadcast-message become low and energy efficiency of a node is enhanced, but reachability\nbecome low. Therefore, it is necessary to study an efficient counter-based broadcast scheme that can\ndynamically adjust the random access delay and count threshold value to ensure high reachability,\nlow redundant of broadcast-messages, and low energy consumption of nodes. Thus, in this paper,\nwe first measure the additional coverage provided by a node that receives the same broadcast-message\nfrom two neighbor nodes, in order to achieve high reachability with low redundant retransmissions\nof broadcast-messages. Second, we propose a new counter-based broadcast scheme considering the\nsize of the additional coverage area, distance between the node and the broadcasting node, remaining\nbattery of the node, and variations of the node density. Finally, we evaluate performance of the\nproposed scheme compared with the existing counter-based broadcast schemes. Simulation results\nshow that the proposed scheme outperforms the existing schemes in terms of saved rebroadcasts,\nreachability, and total energy consumption
Loading....